Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates
نویسندگان
چکیده
Current data models like the NF2 model and object-oriented models support setvalued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates several main memory algorithms to evaluate e ciently this kind of join. More speci cally, we concentrate on the set equality and the subset predicates.
منابع مشابه
Evaluation of Main Memory Join Algorithms for Joins with Subset Join Predicates
Current data models like the NF2 model and object,-oriented models support set-valued at.t,ribut,t:s. Hence, it, becomes possible to havt> join prcdica.tes ba.sed on set, comparison. This paper int,roduces and evaluates two main memory algorithms to evaluate efficiently this kind of join. More specifically, we concentrate on subset predicates.
متن کاملEvaluation of Main Memory Join Algorithms for
Current data models like the NF 2 model and object-oriented models support set-valued attributes. Hence, it becomes possible to have join predicates based on set comparison. This paper introduces and evaluates two main memory algorithms to evaluate eeciently this kind of join. More speciically, we concentrate on subset predicates.
متن کاملOn Multi-way Spatial Joins with Direction Predicates
Spatial joins are fundamental in spatial databases. Over the last decade, the primary focus of research has been on joins with the predicate “region intersection.” In modern database applications involving geospatial data such as GIS, efficient evaluation of joins with other spatial predicates is yet to be fully explored. In addition, most existing join algorithms were developed for two-way joi...
متن کاملFaster Joins, Self Joins and Multi-Way Joins Using Join Indices
We propose a new algorithm called Stripe join for performing a join given a join index Stripe join is inspired by an algorithm called Jive join developed by Li and Ross Stripe join makes a single sequential pass through each input relation in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identi ers but no input tuples Stripe join pe...
متن کاملFaster Joins , Self - Joins and
We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross. Stripe-join makes a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identiiers but no input tuples. Stripe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997